Improved Head-Corner Parsing of Tree-Adjoining Grammars
نویسنده
چکیده
In this paper we present a chart-based head corner parsing algorithm for Tree Adjoining Grammars (TAGs). We then present an improved algorithm that has a O(n) bound for the number of head-corner predictions as compared to previous approaches which have a bound of O(n). The improvement is made possible by changing the de nition of headcorner traversal and moving some aspects of top-down prediction in the recognizer into the bottom-up component.
منابع مشابه
Head-Corner Parsing for TAG
This paper describes a bidirectional head-corner parser for (uniication-based versions of) Lexicalized Tree Adjoining Grammars.
متن کاملPractical experiments in parsing using Tree Adjoining Grammars
We present an implementation of a chart-based head-corner parsing algorithm for lexicalized Tree Adjoining Grammars. We report on some practical experiments where we parse 2250 sentences from the Wall Street Journal using this parser. In these experiments the parser is run without any statistical pruning; it produces all valid parses for each sentence in the form of a shared derivation forest. ...
متن کاملA Predictive Left-Corner Parser for Tree Adjoining Grammars
Tree Adjoining Grammar (TAG) is a formalism that has become very popular for the description of natural languages. However, the parsers for TAG that have been defined on the basis of the Earley’s algorithm entail important computational costs. In this article, we propose to extend the left corner relation from Context Free Grammar (CFG) to TAG in order to define an efficient left corner parser ...
متن کاملParsing Tree Adjoining Grammars and Tree Insertion Grammars with Simultaneous Adjunctions
A large part of wide coverage Tree Adjoining Grammars (TAG) is formed by trees that satisfy the restrictions imposed by Tree Insertion Grammars (TIG). This characteristic can be used to reduce the practical complexity of TAG parsing, applying the standard adjunction operation only in those cases in which the simpler cubic-time TIG adjunction cannot be applied. In this paper, we describe a parsi...
متن کاملLambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars
Two recent extension of the nonassociative Lambek calculus, the LambekGrishin calculus and the multimodal Lambek calculus, are shown to generate class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.
متن کامل